Dembowski–Ostrom polynomials from Dickson polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dembowski-Ostrom polynomials from Dickson polynomials

Motivated by several recent results, we determine precisely when Fk(X , a)− Fk(0, a) is a Dembowski-Ostrom polynomial, where Fk(X, a) is a Dickson polynomial of the first or second kind. As a consequence, we obtain a classification of all such polynomials which are also planar; all examples found are equivalent to previously known examples.

متن کامل

Cyclic Codes from Dickson Polynomials

Due to their efficient encoding and decoding algorithms, cyclic codes, a subclass of linear codes, have applications in communication systems, consumer electronics, and data storage systems. In this paper, Dickson polynomials of the first kind over finite fields are employed to construct a number of classes of cyclic codes. Lower bounds on the minimum weight of some classes of the cyclic codes ...

متن کامل

On Modified Dickson Polynomials

were defined and studied by P. Fllipponi In the case a-\ in [1], where several identities and congruences were established. In this note we generalize some of those theorems and present some new properties of these polynomials. One basic result is Proposition 2 in [1] which states that if/? is an odd prime and k is an integer, then Zp(k,l) = (k\p) (mod/0, (1-2) where (k \p) is the Legendre symb...

متن کامل

Dickson Polynomials That Are Permutations

A theorem of S.D. Cohen gives a characterization for Dickson polynomials of the second kind that permutes the elements of a finite field of cardinality the square of the characteristic. Here, a different proof is presented for this result. 1. Permutation polynomials of finite fields. In recent years cryptographers became interested in finding polynomials that induce a bijection of a finite fiel...

متن کامل

Exponential sums with Dickson polynomials

We give new bounds of exponential sums with sequences of iterations of Dickson polynomials over prime finite fields. This result is motivated by possible applications to polynomial generators of pseudorandom numbers. © 2004 Elsevier Inc. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2010

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2010.06.002